#include "Tree.h"
int main()
{
	TreeNode* A = (TreeNode*)malloc(sizeof(TreeNode));
	if (A == NULL)
		return;
	A->val = 'A';
	A->left = NULL;
	A->right = NULL;

	TreeNode* B = (TreeNode*)malloc(sizeof(TreeNode));
	if (B == NULL)
		return;
	B->val = 'B';
	B->left = NULL;
	B->right = NULL;

	TreeNode* C = (TreeNode*)malloc(sizeof(TreeNode));
	if (C == NULL)
		return;
	C->val = 'C';
	C->left = NULL;
	C->right = NULL;

	TreeNode* D = (TreeNode*)malloc(sizeof(TreeNode));
	if (D == NULL)
		return;
	D->val = 'D';
	D->left = NULL;
	D->right = NULL;

	TreeNode* E = (TreeNode*)malloc(sizeof(TreeNode));
	if (E == NULL)
		return;
	E->val = 'E';
	E->left = NULL;
	E->right = NULL;

	/*BTNode* F = (BTNode*)malloc(sizeof(BTNode));
	if (F == NULL)
		return;
	F->data = 'F';
	F->left = NULL;
	F->right = NULL;

	BTNode* G = (BTNode*)malloc(sizeof(BTNode));
	if (G == NULL)
		return;
	G->data = 'G';
	G->left = NULL;
	G->right = NULL;*/


	A->left = B;
	A->right = C;
	B->left = D;
	B->right = E;

	TreeNode* ret = BinaryTreeFind(A, 'C');
	printf("%c\n", ret->val);
	printf("%d", BinaryTreeLevelKSize(A, 3));
	BinaryTreeLevelOrder(A);
	return 0;
}